In this paper, it is mainly discussed a finite-state deterministic fuzzy automaton ( FDA), which is not only equivalent to corresponding fuzzy language and is also equally powerful as other automata. 作者讨论了有限态确定模糊自动机FDA与它相应的模糊语言以及FDA与其它自动机的等价性。
This is a foundation for deep researches on fuzzy finite-state automaton and fuzzy regular language. 这为进一步研究Fuzzy有限状态自动机和Fuzzy正则语言奠定了基础。